A genetic algorithm for a university weekly courses timetabling problem
نویسندگان
چکیده
The timetabling problem is concerned with the allocation, subject to constraints, of given resources to objects in space and time in such way as to satisfy as nearly as possible a set of desirable objectives. This problem is known to be NP-complete and as such only combinatorial optimization methods can guarantee an optimal timetable. In this paper we propose a sector-based genetic algorithm for solving a university weekly courses timetabling problem. Preliminary experimental results indicate that the algorithm is promising.
منابع مشابه
Generating Optimal Timetabling for Lecturers using Hybrid Fuzzy and Clustering Algorithms
UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...
متن کاملAn Investigation of a Genetic Algorithm and Sequential Local Search Approach for Curriculum-based Course Timetabling Problems
Curriculum-based course timetabling deals with the weekly assignment of a set of lectures for university courses to specific timeslots and rooms, where conflicts between courses are set according to curricula published by the university and not on the basis of enrolment data. The curriculum-based course timetabling is considered as the third track in the 2 International timetabling competition ...
متن کاملارایه یک مدل ریاضی جدید جهت برنامه ریزی جدول زمان بندی دروس دانشگاهی بر اساس کیفیت ارایه دروس
One of the important tasks of universities that are usually challenging is university course timetabling problem. They are faced with this problem every year and every term and which is directly effective on education performance. In the university course timetabling problem, the university sources including lessons, lecturers, classes and other teaching sources are assigned to a series of time...
متن کاملTowards a Deterministic Algorithm for the International Timetabling Competition
The Course Timetabling Problem consists of the weekly scheduling of lectures of a collection of university courses, subject to certain constraints. The International Timetabling Competitions, ITC-2002 and ITC-2007, have been organized with the aim of creating a common formulation for comparison of solution proposals. This paper discusses the design and implementation of an extendable family of ...
متن کاملA Genetic Algorithm Solving a Weekly Course-Timetabling Problem
In this paper we describe a heavily constrained university timetabling problem, and our genetic algorithm based approach to solve it. A problem-specific chromosome representation and knowledge-augmented genetic operators have been developed; these operators ‘intelligently’ avoid building illegal timetables. The prototype timetabling system which is presented has been implemented in C and PROLOG...
متن کامل